Autocorrelation-Run Formula for Binary Sequences
نویسنده
چکیده
The autocorrelation function and the run structure are two basic notions for binary sequences, and have been used as two independent postulates to test randomness of binary sequences ever since Golomb 1955. In this paper, we prove for binary sequence that the autocorrelation function is in fact completely determined by its run structure.
منابع مشابه
Se p 20 09 Autocorrelation - Run Formula for Binary Sequences ∗
The autocorrelation function and the run structure are two basic notions for binary sequences, and they have been used as two independent criterions to characterize the randomness of binary sequences for more than 30 years. In this paper, we establish a run series expansion formula for autocorrelation function of the binary sequence and show that the autocorrelation function is in fact complete...
متن کاملExhaustive Search for Low Autocorrelation Binary Sequences
Binary sequences with low autocorrelations are important in communication engineering and in statistical mechanics as groundstates of the Bernasconimodel. Computer searches are the main tool to construct such sequences. Due to the exponential size O(2 ) of the configuration space, exhaustive searches are limited to short sequences. We discuss an exhaustive search algorithm with run time charact...
متن کاملA General Construction of Binary Sequences with Optimal Autocorrelation
A general construction of binary sequences with low autocorrelation are considered in the paper. Based on recent progresses about this topic and this construction, several classes of binary sequences with optimal autocorrelation and other low autocorrelation are presented.
متن کاملSeveral classes of binary sequences with three-level autocorrelation
In this correspondence we describe several classes of binary sequences with three-level autocorrelation. Those classes of binary sequences are based on cyclic almost difference sets. Some classes of binary sequences have optimum autocorrelation.
متن کاملThe linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length 2p
In this article, we generalize results about binary sequences of length 2p and evaluate the linear complexity and autocorrelation properties of generalized cyclotomic binary sequences of length 2p. We show that in most cases these sequences have high linear complexity and poor autocorrelation performance.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0909.4592 شماره
صفحات -
تاریخ انتشار 2009